Piecewise Function Approximation With Private Data
نویسندگان
چکیده
منابع مشابه
Continuous Piecewise Linear Approximation of BV Function
Nonlinear approximation is widely used in signal processing. Real-life signals can be modeled as functions of bounded variation. Thus the variable knot of approximating function could be selfadaptively chosen by balancing the total variation of the target function. In this paper, we adopt continuous piecewise linear approximation instead of the existing piecewise constants approximation. The re...
متن کاملEfficient algorithms for function approximation with piecewise linear sigmoidal networks
This paper presents a computationally efficient algorithm for function approximation with piecewise linear sigmoidal nodes. A one hidden layer network is constructed one node at a time using the well-known method of fitting the residual. The task of fitting an individual node is accomplished using a new algorithm that searches for the best fit by solving a sequence of quadratic programming prob...
متن کاملFiltering Motion Data Through Piecewise Polynomial Approximation
In this work we propose a system to filter human movement data and store them into a compact representation. We are interested both in noise reduction and in segmentation. The method described in this paper relies on a iterative optimization and guarantee to converge to a local optimum: it proved anyway to produce stable results and to provide an accurate segmentation on the analyzed data . We ...
متن کاملEfficient Piecewise-Linear Function Approximation Using the Uniform Metric
We give an O(n log n)-time method for nding a best k-link piecewise-linear function approximating an n-point planar data set using the well-known uniform metric to measure the error, 0, of the approximation. Our method is based upon new characterizations of such functions, which we exploit to design an eecient algorithm using a plane sweep in \ space" followed by several applications of the par...
متن کاملDiscrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function
Theory and algorithms are presented for the following smoothing problem. We are given n measurements of a real-valued function that have been altered by random errors caused by the deriving process. For a given integer k , some efficient algorithms are developed that approximate the data by minimizing the sum of strictly convex functions of the errors in such a way that the approximated values ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Forensics and Security
سال: 2016
ISSN: 1556-6013,1556-6021
DOI: 10.1109/tifs.2015.2503268